$EL^2$–hyperstructures Derived from (Partially) Quasi Ordered Hyperstructures
Authors
Abstract:
In this paper, we introduce a new class of (semi)hypergroup from a given (partially) quasi-ordered (semi)hypergroup as a generalization of {it "$El$--hyperstructures"}. Then, we study some basic properties and important elements belong to this class.}
similar resources
n–ary hyperstructures constructed from binary quasi–ordered semigroups
Based on works by Davvaz, Vougiouklis and Leoreanu-Fotea in the field of n–ary hyperstructures and binary relations we present a construction of n–ary hyperstructures from binary quasi-ordered semigroups. We not only construct the hyperstructures but also study their important elements such as identities, scalar identities or zeros. We also relate the results to earlier results obtained for a s...
full textSeveral Aspects of Generalizing One Construction of Hyperstructures from Quasi-ordered Semigroups
EL–hyperstructures are hyperstructures constructed from singlevalued quasi-ordered semigroups. For some kinds of sets it is difficult to find a meaningful single-valued associative operation which could be used as a basis for constructing the EL–hyperstructure. In this paper we use the systematic approach to define it. We focus on multicomponent sets and briefly mention the n–ary context of the...
full textQuasi-preference: Choice on Partially Ordered Sets
A preference relation is a total order on a finite set and a quasipreference relation is a partial order. This paper first introduces the classic axiomatic property of preference relation, and develops a similar axiom for the quasi-preference relation.
full textTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
full textFrom Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets
We consider conditions which force a well-quasi-ordered poset (wqo) to be betterquasi-ordered (bqo). In particular we obtain that if a poset P is wqo and the set Sω(P ) of strictly increasing sequences of elements of P is bqo under domination, then P is bqo. As a consequence, we get the same conclusion if Sω(P ) is replaced by J (P ), the collection of non-principal ideals of P , or by AM(P ), ...
full textMTL-algebras arising from partially ordered groups
After dropping the implication-like operation and reversing the order, an MTL-algebra becomes a partially ordered structure (L;≤,⊕, 0, 1) based on the single addition-like operation ⊕. Furthermore, ⊕ may be restricted to a partial, but cancellative addition + without loss of information. We deal in this paper with the case that the resulting partial algebra (L;≤,+, 0, 1) is embeddable into the ...
full textMy Resources
Journal title
volume 10 issue None
pages 99- 114
publication date 2015-10
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023